A Block-Building Based GRASP Method for Solving Container Loading Problem
نویسندگان
چکیده
The importance of container transportation is constantly increasing. For this reason, lower cost great for companies in by air, land, rail and sea domestic international markets. One way reducing the costs to utilize volume effectively. In study, a block-building based GRASP method proposed solving loading problem. results are compared with other methods heuristic or meta-heuristic algorithms literature. show improvements comparison methods.
منابع مشابه
A Tree Search Algorithm for Solving the Container Loading Problem
The paper presents a tree search algorithm for the three-dimensional container loading problem (3D-CLP). The 3D-CLP is the problem of loading a subset of a given set of rectangular boxes into a rectangular container so that the packed volume is maximized. The method has two variants: the packing variant guarantees full support from below for all packed boxes, while this constraint is not taken ...
متن کاملA GRASP-Based Algorithm for Solving DVE Partitioning Problem
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to solve a set of internal problems associated with the heterogeneity in client-side hardware, network bandwidth and graphic application requirements efficiently. The problem of properly assigning clients (3D avatars) to ser...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAlgorithms for the Container Loading Problem
In this paper we consider the three-dimensional problem of optimal packing of a container with rectangular pieces. We propose an approximation algorithm based on the "forward state strategy" of dynamic programming. A suitable description of packings is developed for the implementation of the approximation algorithm, and some computational experience is reported. Zusammenfassung: Zur nn aherungs...
متن کاملHeuristics for the container loading problem
The knapsack container loading problem is the problem of loading a subset of rectangular boxes into a rectangular container of fixed dimensions such that the volume of the packed boxes is maximized. A new heuristic based on the wall-building approach is proposed, which decomposes the problem into a number of layers which again are split into a number of strips. The packing of a strip may be for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in artificial intelligence research
سال: 2023
ISSN: ['2757-7422']
DOI: https://doi.org/10.54569/aair.1216400